An adaptive bidding strategy for combinatorial auctions-based resource allocation in dynamic markets

نویسندگان

  • Xin Sui
  • Ho-fung Leung
چکیده

Combinatorial auctions, where bidders are allowed to submit bids for bundles of items, are preferred to single-item auctions when bidders have complementarities and substitutabilities among items and therefore achieve better social efficiency. A large unexplored area of research is the design of bidding strategies. In this paper, we propose a new adaptive bidding strategy for combinatorial auctions-based resource allocation. The bidder adopting this strategy can adjust his profit margin constantly, and thus perceive and respond to the market in a timely way. Experiment results show that the adaptive strategy performs fairly well when compared to an intelligent strategy, which is artificially generated according to prior knowledge of the market.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive bidding in combinatorial auctions in dynamic markets

Combinatorial auction, where bidders can bid on bundles of items, has been the subject of increasing interest in recent years. Although much research work has been conducted on combinatorial auctions, most has been focusing on the winner determination problem. A largely unexplored area of research in combinatorial auctions is the design of bidding strategies, in particular, those that can be us...

متن کامل

Optimal Bidding Strategy for Keyword Auctions and Other Continuous-time Markets

This paper models continuous-time mass bidding markets, such as keyword auctions and market-based resource allocation systems, as a stochastic dynamic system that fluctuates around an average value under the influence of its users. The user’s objective to maximize his long-term average utility is formulated as a stochastic control problem. The optimal bidding strategy is calculated both analyti...

متن کامل

Optimal Bidding Strategies of GENCOs in Day-Ahead Energy and Spinning Reserve Markets Based on Hybrid GA-Heuristic Optimization Algorithm

In an electricity market, every generation company (GENCO) attempts to maximize profit according to other participants bidding behaviors and power systems operating conditions. The goal of this study is to examine the optimal bidding strategy problem for GENCOs in energy and spinning reserve markets based on a hybrid GA-heuristic optimization algorithm. The heuristic optimization algorithm used...

متن کامل

Sequential Auctions for the Allocation of Resources with Complementarities

Market-based mechanisms such as auctions are being studied as an appropriate means for resource allocation in distributed and multiagent decision problems. When agents value resources in combination rather than in isolation, one generally relies on combinatorial auctions where agents bid for resource bundles, or simultaneous auctions for all resources. We develop a different model, where agents...

متن کامل

Iterative Combinatorial Auctions: Theory and Practice

Combinatorial auctions, which allow agents to bid directly for bundles of resources, are necessary for optimal auction-based solutions to resource allocation problems with agents that have non-additive values for resources, such as distributed scheduling and task assignment problems. We introduce iBundle, the first iterative combinatorial auction that is optimal for a reasonable agent bidding s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009